Theory and Techniques for Synthesizing E cient Breadth - First Search
نویسندگان
چکیده
v
منابع مشابه
Theory and Techniques for Synthesizing Space-efficient Breadth-first Search Algorithms
Although Breadth-First Search (BFS) has several advantages over DepthFirst Search (DFS) its prohibitive space requirements have meant that algorithm designers often pass it over in favor of DFS. To address this shortcoming, we introduce a theory of space-e cient BFS (SEBFS) along with a simple recursive program schema for carrying out the search. The theory is based on dominance relations, a lo...
متن کاملCMPSCI 311: Introduction to Algorithms
Breadth-First Search. For a graph like the one in Figure 2.3, we can generally figure out the distance between two nodes by eyeballing the picture; but for graphs that are even a bit more complicated, we need some kind of a systematic method to determine distances. The most natural way to do this — and also the most e cient way to calculate distances for a large network dataset using a computer...
متن کاملTheory and Techniques for Synthesizing a Family of Graph Algorithms
Although Breadth-First Search (BFS) has several advantages over Depth-First Search (DFS) its prohibitive space requirements have meant that algorithm designers often pass it over in favor of DFS. To address this shortcoming, we introduce a theory of Efficient BFS (EBFS) along with a simple recursive program schema for carrying out the search. The theory is based on dominance relations, a long s...
متن کاملSimple and efficient network decomposition and synchronization
We present a simple and e cient method for constructing sparse decompositions of networks. This method is used to construct the sparse decompositions needed for variants of the synchronizers in [2, 15] in O(|V |) time and O(|E| + |V | log |V |) communication complexities, while maintaining constant messages size and constant memory per edge. Using these decompositions, we present simple and e c...
متن کاملMaximum Flows by Incremental Breadth-First Search
Maximum flow and minimum s-t cut algorithms are used to solve several fundamental problems in computer vision. These problems have special structure, and standard techniques perform worse than the special-purpose Boykov-Kolmogorov (BK) algorithm. We introduce the incremental breadth-first search (IBFS) method, which uses ideas from BK but augments on shortest paths. IBFS is theoretically justif...
متن کامل